Discovering colored Petri nets from event logs
نویسندگان
چکیده
منابع مشابه
Discovering Petri Nets from Event Logs
As information systems are becoming more and more intertwined with the operational processes they support, multitudes of events are recorded by todays information systems. The goal of process mining is to use such event data to extract process related information, e.g., to automatically discover a process model by observing events recorded by some system or to check the conformance of a given m...
متن کاملDiscovering Architectures from Running Systems using Colored Petri Nets
One of the challenging problems for software developers is guaranteeing that a system as built is consistent with its architectural design. In this paper we describe a technique that uses run time observations about an executing system to construct an architectural view of the system. In this technique we develop mappings that exploit regularities in system implementation and architectural styl...
متن کاملA Region-Based Algorithm for Discovering Petri Nets from Event Logs
The paper presents a new method for the synthesis of Petri nets from event logs in the area of Process Mining. The method derives a bounded Petri net that over-approximates the behavior of an event log. The most important property is that it produces a net with the smallest behavior that still contains the behavior of the event log. The methods described in this paper have been implemented in a...
متن کاملDiscovering Stochastic Petri Nets with Arbitrary Delay Distributions from Event Logs
Capturing the performance of a system or business process as accurately as possible is important, as models enriched with performance information provide valuable input for analysis, operational support, and prediction. Due to their computationally nice properties, memoryless models such as exponentially distributed stochastic Petri nets have earned much attention in research and industry. Howe...
متن کاملMarkov Decision Processes from Colored Petri Nets
Models that are suitable for planning are not always easy to specify. In this paper we investigate the conversion of Petri nets into factored Markov decision processes: the former are relatively easy to build while the latter are adequate for policy generation. To represent probabilities that are needed when planning under uncertainty, we introduce factored Petri nets; we then describe the conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2007
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-007-0051-0